Convex Polygons are Self-Coverable
نویسندگان
چکیده
We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family with many points contains all colors. This is dual (and in some cases equivalent) to the much investigated cover-decomposability problem.
منابع مشابه
Asymptotic behaviour of convex and column-convex lattice polygons with fixed area and varying perimeter
We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight μ exp[−Jb] is associated to a polygon with perimeter t and b bends. The mean perimeter is calculated as a function of the fugacity μ and the bending rigidity J . In the limit μ → 0, the mean perimeter has the asymptotic behaviour 〈t〉/4 √ A ≃ 1−K...
متن کاملInversion Relations, Reciprocity and Polyominoes
We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. Fo...
متن کاملThe linking number and the writhe of uniform random walks and polygons in confined spaces
Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the ...
متن کاملAsymptotic Behavior of Inflated Lattice Polygons
We study the inflated phase of two dimensional lattice polygons with fixed perimeter N and variable area, associating a weight exp[pA− Jb] to a polygon with area A and b bends. For convex and column-convex polygons, we show that 〈A〉/Amax = 1−K(J)/p̃ 2 + O(ρ), where p̃ = pN ≫ 1, and ρ < 1. The constant K(J) is found to be the same for both types of polygons. We argue that self-avoiding polygons sh...
متن کاملOsculating and neighbour-avoiding polygons on the square lattice*
We study two simple modifications of self-avoiding polygons (SAPs). Osculating polygons (OP) are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons (NAP) are only allowed to have nearest-neighbour vertices provided these are joined by the associated edge and thus form a sub-set of SAPs. We use the finite lattice method to count the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 51 شماره
صفحات -
تاریخ انتشار 2014